ACL2 for Freshmen: First Experiences
نویسندگان
چکیده
Northeastern University’s College of Computer Science uses an applicative subset of Scheme in its introductory programming course with a heavy emphasis on design. Students then proceed to a second-semester programming course using Java and a course on symbolic logic. During the 2007 spring semester, we experimented with an ACL2-based course as a potential replacement for the freshman course on symbolic logic. This paper reports on the specifics of the experiment (context, syllabus, students), its mixed outcomes, and our conclusions for future revisions. Based on our preliminary experiences, the College has decided to adopt our experimental course as the standard course.
منابع مشابه
Integrating Nonlinear Arithmetic into ACL2
In this paper we present an overview of the integration of a nonlinear arithmetic reasoning package into ACL2. We provide a brief operational description of the entire arithmetic package and describe how it fits into ACL2’s operation, including what was needed for the successful introduction of such a facility into an existing automated theorem prover. We describe most of the changes we made to...
متن کاملACL2(ml): Machine-Learning for ACL2
ACL2(ml) is an extension for the Emacs interface of ACL2. This tool uses machine-learning to help the ACL2 user during the proof-development. Namely, ACL2(ml) gives hints to the user in the form of families of similar theorems, and generates auxiliary lemmas automatically. In this paper, we present the two most recent extensions for ACL2(ml). First, ACL2(ml) can suggest now families of similar ...
متن کاملIvy : a Preprocessor and Proofchecker for First - Order
This case study shows how non-ACL2 programs can be combined with ACL2 functions in such a way that useful properties can be proved about the composite programs. Nothing is proved about the non-ACL2 programs. Instead, the results of the non-ACL2 programs are checked at run time by ACL2 functions, and properties of these checker functions are proved. The application is resolution/paramodulation a...
متن کاملChapter 1 IVY : A PREPROCESSOR AND PROOFCHECKER FOR FIRST - ORDER LOGICWilliam
This case study shows how non-ACL2 programs can be combined with ACL2 functions in such a way that useful properties can be proved about the composite programs. Nothing is proved about the non-ACL2 programs. Instead, the results of the non-ACL2 programs are checked at run time by ACL2 functions, and properties of these checker functions are proved. The application is resolution/paramodulation a...
متن کاملSecond-Order Functions and Theorems in ACL2
SOFT (‘Second-Order Functions and Theorems’) is a tool to mimic second-order functions and theorems in the first-order logic of ACL2. Second-order functions are mimicked by first-order functions that reference explicitly designated uninterpreted functions that mimic function variables. First-order theorems over these second-order functions mimic second-order theorems universally quantified over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007